Inferring decision trees using the minimum description lenght principle

Inferring Decision Trees Using the Minimum Description Length Principle

This paper concerns methods for inferring decision trees from examples for classification problems. The reader who is unfamiliar with this problem may wish to consult J. R. Quinlan’s paper (1986), or the excellent monograph by Breiman et al. (1984), although this paper will be self-contained. This work is inspired by Rissanen’s work on the Minimum description length principle (or MDLP for short...

Decision Trees Using the Minimum Entropy-of-Error Principle

Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estimates of the class distributions. In the present paper we introduce a new concept to binary tree design: instead of working with the class distributions of the data we work directly with the distribution of the errors ...

On random minimum lenght spanning trees

Inferring Informed Clustering Problems with Minimum Description Length Principle

...............................................................................................................................iii Acknowledgements.............................................................................................................. iv Table of

Inferring gene regulatory networks from time series data using the minimum description length principle

MOTIVATION A central question in reverse engineering of genetic networks consists in determining the dependencies and regulating relationships among genes. This paper addresses the problem of inferring genetic regulatory networks from time-series gene-expression profiles. By adopting a probabilistic modeling framework compatible with the family of models represented by dynamic Bayesian networks...